Dificulty Adjustment in Tetris with Time Series

نویسندگان

  • Diana Lora
  • Antonio A. Sánchez-Ruiz-Granados
  • Pedro A. González-Calero
چکیده

Keeping a player within the flow in a game is a central goal for game designers, making the game neither too easy nor too hard. Dynamic Difficulty adjustment seeks to fulfill this goal by dynamically tuning difficulty according to player actions in the game. In this paper we demonstrate that case-based reasoning with time series can serve to automatically identify the ability of a player in a game, and thus serve as the input for difficulty adjustment based on player ability. We try different configurations for the generation of the case base from game logs, and compare them in terms of how well they classify player ability.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

AC/RL HW 1: Tetris

Although the statement is succinct, there are a number of challenges that make this an intruiging problem. For example, each game drops a random series of pieces. Small variations in this series can lead to a large difference in score, even while using the same strategy. The reader has likely experienced this during a game of tetris; over time it is common to develop a deep empty slot that need...

متن کامل

TREND-CYCLE ESTIMATION USING FUZZY TRANSFORM OF HIGHER DEGREE

In this paper, we provide theoretical justification for the application of higher degree fuzzy transform in time series analysis. Under the assumption that a time series can be additively decomposed into a trend-cycle, a seasonal component and a random noise, we demonstrate that the higher degree fuzzy transform technique can be used for the estimation of the trend-cycle, which is one of the ba...

متن کامل

How to Construct Tetris Configurations

In this paper we show that every (reasonable) TETRIS configuration can be constructed from an initially empty game board using a suitable sequence of pieces. On game boards of even width a simple parity condition has to be fulfilled. The paper provides an explicit construction. This problem is connected to the NP-completeness of certain TETRIS related decision problems. INTRODUCTION It has rece...

متن کامل

Total Tetris : Tetris with Monominoes , Dominoes , Trominoes , Pentominoes , . .

We consider variations on the classic video game Tetris where pieces are k-ominoes instead of the usual tetrominoes (k = 4), as popularized by the video games ntris and Pentris. We prove that it is NP-complete to survive or clear a given initial board with a given sequence of pieces for each k ≥ 5, complementing the previous NP-completeness result for k = 4. More surprisingly, we show that boar...

متن کامل

Comparing reinforcement learning in humans and artificial intelligence through Tetris

Tetris has a long history in Artificial Intelligence (Fahey, 2014) and Cognitive Science (Mayer, in press). We combine both traditions to ask, ”what can Tetris and these two approaches to Tetris, tell us about human expertise?” In our research, we use Cross-Entropy Reinforcement Learning (Szita and Larincz, 2006) to produce two very different types of models; an unsupervised version trained dir...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016